A Novel Distributed Rsa Blind and Weakly Undeniable Multi-signature Scheme

نویسندگان

  • Chih-Ying Chen
  • Hsiu-Feng Lin
چکیده

Digital signature is extensively used in many practical applications as numerous cryptographic services have been proposed. In this paper, we will be the first to propose a signature scheme that integrates the following properties. (1) It is a distributed RSA-type multi-signature. (2) It is a blind and weakly undeniable signature. (3) The modulus used by each participant cosigner is identical. (4) Its signature form is identical to that of a standard RSA signature. (5) The length of the signature is independent of the number of participant cosigners. (6) “Zero-knowledge undeniable signatures” is applied to execute the confirmation/disavowal protocols. (7) “The Gap-Problem” is used to solve the forgery problems. A multi-signature distributes the authority and responsibility of the signer among a set of cosigners with efficiency. The blindness and unlinkability properties found in blind signatures can effectively protect the privacy and anonymity of the signature requester. The confirmation and disavowal protocol found in weakly undeniable signatures can safeguard the signature requesters from accepting invalid signatures and reject valid ones. They also protect the signers from false accusations that sign invalid signatures. Therefore, our scheme is suitable for many important cryptographic services, such as electronic voting, electronic payment and other electronic commercial services.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Undeniable Threshold Proxy Signature Scheme

The threshold proxy signature scheme allows the original signer to delegate a signature authority to the proxy group member to cooperatively sign message on behalf of an original signer. In this paper, we also propose a new scheme which includes the features and benefits of the RSA scheme which is a popular security technique. Also, we will evaluate a security of undeniable threshold proxy sign...

متن کامل

Threshold Undeniable RSA Signature Scheme

Undeniable signature has been extensively researched after Chaum and Antwerpen first proposed the concept of this special digital signature ten years ago. Up to now, however, almost all the existed schemes are based on discrete logarithm cryptosystems. In this paper, based on an improvement of the practical threshold RSA signature scheme proposed by Shoup at Eurocrypt’2000 and the first undenia...

متن کامل

Anonymity and Denial of Undeniable and Confirmer Signatures

We introduce a new security property for undeniable and con rmer signatures in the multi-user setting, namely, anonymity. We show that many existing systems do not have this property.We modify the original undeniable signature scheme of Chaum and van Antwerpen and the RSA-based undeniable/con rmer signature scheme of Gennaro, Krawczyk and Rabin so that they achieve anonymity. We also provide a ...

متن کامل

Double voter perceptible blind signature based electronic voting protocol

Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter's privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suffer from the same weaknesses. In this p...

متن کامل

RSA-Based Undeniable Signatures for General Moduli

Gennaro, Krawczyk and Rabin gave the first undeniable signature scheme based on RSA signatures. However, their solution required the use of RSA moduli which are a product of safe primes. This paper gives techniques which allow RSA-based undeniable signatures for gen-

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012